#递归实现斐波那契数列
def fib(n):
    if n == 1 or n == 2:
        return 1
    return fib(n-1) + fib(n-2)
if __name__ == '__main__':
   
    print (fib(10))    
         